Sphere Packings Give an Explicit Bound for the Besicovitch Covering Theorem
نویسنده
چکیده
We show that the number of disjointed families needed in the Besicovitch Covering Theorem equals the number of unit spheres that can be packed into a ball of radius five, with one at the center, and get estimates on this number.
منابع مشابه
Upper Bounds for Packings of Spheres of Several Radii
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for pa...
متن کاملA Quantitative Version of the Besicovitch Projection Theorem via Multiscale Analysis
By using a multiscale analysis, we establish quantitative versions of the Besicovitch projection theorem (almost every projection of a purely unrectifiable set in the plane of finite length has measure zero) and a standard companion result, namely that any planar set with at least two projections of measure zero is purely unrectifiable. We illustrate these results by providing an explicit (but ...
متن کاملA Lower Bound on the Density of Sphere Packings via Graph Theory
where the supremum is taken over all packings in R. A celebrated theorem of Minkowski states that ∆n ≥ ζ(n)/2 for all n ≥ 2. Since ζ(n) = 1+ o(1), the asymptotic behavior of the Minkowski bound [9] is given by Ω(2). Asymptotic improvements of the Minkowski bound were obtained by Rogers [10], Davenport and Rogers [4], and Ball [2], all of them being of the form ∆n ≥ cn2, where c > 0 is an absolu...
متن کاملNew Conjectural Lower Bounds on the Optimal Density of Sphere Packings
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the maximal packing density due to Minkowski in d-dimensional Euclidean space R. The asymptotic behavior of this bound is controlled by 2 in high dimensions. Using an ...
متن کاملCharacterization of maximally random jammed sphere packings. II. Correlation functions and density fluctuations.
In the first paper of this series, we introduced Voronoi correlation functions to characterize the structure of maximally random jammed (MRJ) sphere packings across length scales. In the present paper, we determine a variety of different correlation functions that arise in rigorous expressions for the effective physical properties of MRJ sphere packings and compare them to the corresponding sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994